Weight-Based Boosting Model for Cross-Domain Relevance Ranking Adaptation
نویسندگان
چکیده
Adaptation techniques based on importance weighting were shown effective for RankSVM and RankNet, viz., each training instance is assigned a target weight denoting its importance to the target domain and incorporated into loss functions. In this work, we extend RankBoost using importance weighting framework for ranking adaptation. We find it non-trivial to incorporate the target weight into the boosting-based ranking algorithms because it plays a contradictory role against the innate weight of boosting, namely source weight that focuses on adjusting source-domain ranking accuracy. Our experiments show that among three variants, the additive weight-based RankBoost, which dynamically balances the two types of weights, significantly and consistently outperforms the baseline trained directly on the source domain.
منابع مشابه
Adapting a Ranking Model for Domain-Specific Search
An adaptation process is described to adapt a ranking model constructed for a broad-based search engine for use with a domain-specific ranking model. It’s difficult to applying the broad-based ranking model directly to different domains due to domain differences, to build a unique ranking model for each domain it time-consuming for training models. In this paper,we address these difficulties by...
متن کاملFace Alignment Using a Ranking Model based on Regression Trees
In this work, we exploit the regression trees-based ranking model, which has been successfully applied in the domain of web-search ranking, to build appearance models for face alignment. The model is an ensemble of regression trees which is learned with gradient boosting. The MCT (Modified Census Transform) as well as its unbinarized version PCT (Pseudo Census Transform) are used as features du...
متن کاملModel Adaptation via Model Interpolation and Boosting for Web Search Ranking
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The results show that model interpolation, though simple, achieves the best results on all the open test sets where the test data is very different from the training data. The tree-based boosting algorithm achieves the best p...
متن کاملExpected Divergence Based Feature Selection for Learning to Rank
(i) RankSVM SVM based pairwise ranker. (ii) RankBoost Weak ranker based pairwise ranker that uses boosting. (iii) LambdaMART LambdaMART uses gradient boosting to optimize a ranking cost function. Baseline 1: FS-BFS The FS-BFS is a wrapper based approach of feature selection for ranking [Dang and Croft, 2010]. The method partitions the F into non-overlapping k subsets and learns a ranking model ...
متن کاملTranslation-based ranking in cross-language information retrieval
Today’s amount of user-generated, multilingual textual data generates the necessity for information processing systems, where cross-linguality, i.e the ability to work on more than one language, is fully integrated into the underlying models. In the particular context of Information Retrieval (IR), this amounts to rank and retrieve relevant documents from a large repository in language A, given...
متن کامل